1e-Domination on Cartesian Product of Path Semigraphs
نویسندگان
چکیده
منابع مشابه
Integer domination of Cartesian product graphs
Given a graph G, a dominating set D is a set of vertices such that any vertex not in D has at least one neighbor in D. A {k}-dominating multiset Dk is a multiset of vertices such that any vertex in G has at least k vertices from its closed neighborhood in Dk when counted with multiplicity. In this paper, we utilize the approach developed by Clark and Suen (2000) to prove a ‘‘Vizing-like’’ inequ...
متن کاملHyper Domination in Bipartite Semigraphs
Let S be a bipartite semigraph with |NXa(y)| ≥ 1 for every y ∈ Y . A vertex x ∈ X hyper dominates y ∈ Y if y ∈ Na(x) or y ∈ Na(NY a(x)). A subsetD ⊆ X is a hyper dominating set of S if every y ∈ Y is hyper dominated by a vertex ofD. A subsetD ⊆ X is called a minimal hyper dominating set of S if no proper subset of D is a hyper dominating set of S. The minimum cardinality of a minimal hyper domi...
متن کاملTotal Domination Number of Cartesian Product Networks
Let denote the Cartesian product of graphs and A total dominating set of with no isolated vertex is a set of vertices of such that every vertex is adjacent to a vertex in The total domination number of is the minimum cardinality of a total dominating set. In this paper, we give a new lower bound of total domination number of using parameters total domination, packing and -domination numbers of ...
متن کاملOn Domination Numbers of Cartesian Product of Paths
We show the link between the existence of perfect Lee codes and minimum dominating sets of Cartesian products of paths and cycles. From the existence of such a code we deduce the asymptotical values of the domination numbers of these graphs.
متن کاملOn Path-pairability in the Cartesian Product
9 We study the inheritance of path-pairability in the Cartesian product of 10 graphs and prove additive and multiplicative inheritance patterns of path11 pairability, depending on the number of vertices in the Cartesian product. 12 We present path-pairable graph families that improve the known upper 13 bound on the minimal maximum degree of a path-pairable graph. Further 14 results and open que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1921/1/012125